Asymptotic Error Free Partitioning over Noisy Boolean Multiaccess Channels

In this paper, we consider the problem of partitioning active users in a manner that facilitates multi-access without collision. The setting is of a noisy, synchronous, Boolean, multi-access channel where $K$ active users (out of a total of $N$ users) seek to access. A solution to the partition problem places each of the $N$ users in one of $K$ groups (or blocks) such that no two active nodes are in the same block. We consider a simple, but non-trivial and illustrative case of $K=2$ active users and study the number of steps $T$ used to solve the partition problem. By random coding and a suboptimal decoding scheme, we show that for any $T\geq (C_1 +\xi_1)\log N$, where $C_1$ and $\xi_1$ are positive constants (independent of $N$), and $\xi_1$ can be arbitrary small, the partition problem can be solved with error probability $P_e^{(N)} \to 0$, for large $N$. Under the same scheme, we also bound $T$ from the other direction, establishing that, for any $T \leq (C_2 - \xi_2) \log N$, the error probability $P_e^{(N)} \to 1$ for large $N$; again $C_2$ and $\xi_2$ are constants and $\xi_2$ can be arbitrarily small. These bounds on the number of steps are lower than the tight achievable lower-bound in terms of $T \geq (C_g +\xi)\log N$ for group testing (in which all active users are identified, rather than just partitioned). Thus, partitioning may prove to be a more efficient approach for multi-access than group testing.Comment: This paper was submitted in June 2014 to IEEE Transactions on Information Theory, and is under review no

Partition Information and its Transmission over Boolean Multi-Access Channels

In this paper, we propose a novel partition reservation system to study the partition information and its transmission over a noise-free Boolean multi-access channel. The objective of transmission is not message restoration, but to partition active users into distinct groups so that they can, subsequently, transmit their messages without collision. We first calculate (by mutual information) the amount of information needed for the partitioning without channel effects, and then propose two different coding schemes to obtain achievable transmission rates over the channel. The first one is the brute force method, where the codebook design is based on centralized source coding; the second method uses random coding where the codebook is generated randomly and optimal Bayesian decoding is employed to reconstruct the partition. Both methods shed light on the internal structure of the partition problem. A novel hypergraph formulation is proposed for the random coding scheme, which intuitively describes the information in terms of a strong coloring of a hypergraph induced by a sequence of channel operations and interactions between active users. An extended Fibonacci structure is found for a simple, but non-trivial, case with two active users. A comparison between these methods and group testing is conducted to demonstrate the uniqueness of our problem.Comment: Submitted to IEEE Transactions on Information Theory, major revisio

Optimal Parallel Lexicographic Sorting using a Fine-Grained Decomposition

Though non-comparison based sorting techniques like radix sorting can be done with less work than conventional comparison-based methods, they are not used for long keys. This is because even though parallel radix sorting algorithms process the keys in parallel, the symbols in the keys are processed sequentially. In this report, we give an optimal algorithm for lexicographic sorting that can be used to sort n m-bit keys on an EREW model in Ө (log nlogm) time with Ө (mn) work . This algorithm is not only as fast as any optimal non-comparison based algorithm, but can also be executed with less work. We also use the proposed algorithm to show that if n Ө (log n) unsigned binary numbers can be sorted optimally on an EREW PRAM than n unsigned binary numbers of unrestricted length can be sorted optimally on an EREW PRAM

Optimal Parallel Solutions to the Neighbor Localization Problem and Integer Sorting: A Fine Grained Approach

In this report, a fine-grained decomposition approach is used to obtain an optimal parallel solution to the Neighbor Localization Problem, which in turn is œ used to sort n θ(log n)-bit numbers optimally on an EREW model. The model of computation used is the EREW Reconfigurable PRAM (R-PRAM) that permits the use of “very small” processors. The main result of this report is a parallel EREW R-PRAM algorithm that sorts n θ(log n)-bit numbers in θ(log n) time with θ(n log n) “work”. The proposed algorithm is asymptotically optimal in time and efficiency. If a weaker variant of the R-PRAM (called the ISR-PRAM) is used, the efficiency suffers only a slight degradation

Glycerol conversion to 1, 3-Propanediol is enhanced by the expression of a heterologous alcohol dehydrogenase gene in Lactobacillus reuteri

In this work, Lactobacillus reuteri has been metabolically engineered for improving 1, 3-propanediol (1, 3-PD) production by the expression of an Escherichia coli alcohol dehydrogenase, yqhD, that is known to efficiently convert the precursor 3-hydroxypropionaldehyde (3-HPA) to 1, 3-PD. The engineered strain exhibited significantly altered formation rates for the product and other metabolites during the fermentation. An increase in the 1, 3-PD specific productivity of 34% and molar yield by 13% was achieved in the clone, relative to the native strain. A concomitant decrease in the levels of toxic intermediate, 3-HPA, was observed, with the specific productivity levels being 25% lesser than that of the native strain. Interestingly, the recombinant strain exhibited elevated rates of lactate and ethanol formation as well as reduced rate of acetate production, compared to the native strain. The preferential utilization of NADPH by YqhD with a possible decrease in the native 1, 3-PD oxidoreductase (NADH-dependent) activity, could have resulted in the diversion of surplus NADH towards increased lactate and ethanol productivities

Bioinformatics in crosslinking chemistry of collagen with selective cross linkers

<p>Abstract</p> <p>Background</p> <p>Identifying the molecular interactions using bioinformatics tools before venturing into wet lab studies saves the energy and time considerably. The present study summarizes, molecular interactions and binding energy calculations made for major structural protein, collagen of Type I and Type III with the chosen cross-linkers, namely, coenzyme Q₁₀, dopaquinone, embelin, embelin complex-1 & 2, idebenone, 5-O-methyl embelin, potassium embelate and vilangin.</p> <p>Results</p> <p>Molecular descriptive analyses suggest, dopaquinone, embelin, idebenone, 5-O-methyl embelin, and potassium embelate display nil violations. And results of docking analyses revealed, best affinity for Type I (- 4.74 kcal/mol) and type III (-4.94 kcal/mol) collagen was with dopaquinone.</p> <p>Conclusions</p> <p>Among the selected cross-linkers, dopaquinone, embelin, potassium embelate and 5-O-methyl embelin were the suitable cross-linkers for both Type I and Type III collagen and stabilizes the collagen at the expected level.</p

Bacterial Toxins and the Nervous System: Neurotoxins and Multipotential Toxins Interacting with Neuronal Cells

Toxins are potent molecules used by various bacteria to interact with a host organism. Some of them specifically act on neuronal cells (clostridial neurotoxins) leading to characteristics neurological affections. But many other toxins are multifunctional and recognize a wider range of cell types including neuronal cells. Various enterotoxins interact with the enteric nervous system, for example by stimulating afferent neurons or inducing neurotransmitter release from enterochromaffin cells which result either in vomiting, in amplification of the diarrhea, or in intestinal inflammation process. Other toxins can pass the blood brain barrier and directly act on specific neurons